#define _CRT_SECURE_NO_WARNINGS 1

#include "Sort.h"
#include "Stack.h"

void TestOP()
{
	srand((unsigned int)time(0));
	const int N = 100000000;
	//int* a1 = (int*)malloc(sizeof(int) * N);
	int* a2 = (int*)malloc(sizeof(int) * N);
	//int* a3 = (int*)malloc(sizeof(int) * N);
	//int* a4 = (int*)malloc(sizeof(int) * N);
	//int* a5 = (int*)malloc(sizeof(int) * N);


	for (int i = 0; i < N; ++i)
	{
		//a1[i] = rand();
		a2[i] = rand();
		//a3[i] = a1[i];
		//a4[i] = a1[i];
		//a5[i] = a2[i];
	}

	/*int begin1 = clock();
	InsertSort(a1, N);
	int end1 = clock();*/

	int begin2 = clock();
	ShellSort(a2, N);
	int end2 = clock();

	//int begin3 = clock();
	//BubbleSort(a3, N);
	//int end3 = clock();

	//int begin4 = clock();
	//SelectSort(a4, N);
	//int end4 = clock();

	//int begin5 = clock();
	//HeapSort(a5, N);
	//int end5 = clock();

	//printf("InsertSort:%d\n", end1 - begin1);
	printf("ShellSort:%d\n", end2 - begin2);
	//printf("BubbleSort:%d\n", end3 - begin3);
	//printf("SelectSort:%d\n", end4 - begin4);
	//printf("HeapSort:%d\n", end5 - begin5);

	//free(a1);
	free(a2);
	//free(a3);
	//free(a4);
	//free(a5);

}

int main()
{
	int arr[10] = { 5, 3, 8, 6, 2, 7, 1, 9, 4, 0 };

	/*PrintArr(arr, 10);
	InsertSort(arr, 10);
	PrintArr(arr, 10);*/

	/*PrintArr(arr, 10);
	ShellSort(arr, 10);
	PrintArr(arr, 10);*/

	//TestOP();

	//PrintArr(arr, 10);
	//BubbleSort(arr, 10);
	//PrintArr(arr, 10);

	/*PrintArr(arr, 10);
	SelectSort(arr, 10);
	PrintArr(arr, 10);*/

	/*PrintArr(arr, 10);
	HeapSort(arr, 10);
	PrintArr(arr, 10);*/

	//PrintArr(arr, 10);
	//QuickSort(arr, 0, 9);
	//PrintArr(arr, 10);

	//PrintArr(arr, 10);
	//QuickSortNonR(arr, 0, 9);
	//PrintArr(arr, 10);

	/*PrintArr(arr, 10);
	MergeSort(arr, 10);
	PrintArr(arr, 10);*/

	//PrintArr(arr, 10);
	//MergeSortNonR(arr, 10);
	//PrintArr(arr, 10);

	//PrintArr(arr, 10);
	//MergeSortNonR(arr, 10);
	//PrintArr(arr, 10);

	PrintArr(arr, 10);
	CountSort(arr, 10);
	PrintArr(arr, 10);

	return 0;
}